Computation of residual polynomial operators of inductive valuations

نویسندگان

چکیده

Let (K,v) be a valued field, and μ an inductive valuation on K[x] extending v. Gμ the graded algebra of over K[x], κ maximal subfield subring formed by homogeneous elements degree zero. In this paper, we find algorithm to compute field residual polynomial operator Rμ:K[x]→κ[y], where y is another indeterminate, without any need perform computations in algebra. This leads OM factorization separable defectless polynomials henselian fields.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computation on Zagreb Polynomial of Some Families of Dendrimers

In mathematical chemistry, a particular attention is given to degree-based graph invariant. The Zagrebpolynomial is one of the degree based polynomials considered in chemical graph theory. A dendrimer isan artificially manufactured or synthesized molecule built up from branched units called monomers. Inthis note, the first, second and third Zagreb poly...

متن کامل

some properties of fuzzy hilbert spaces and norm of operators

in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...

15 صفحه اول

Residual Ideals of Maclane Valuations

Let K be a field equipped with a discrete valuation v. In a pioneering work, MacLane determined all valuations on K(x) extending v. His work was recently reviewed and generalized by Vaquié, by using the graded algebra of a valuation. We extend Vaquié’s approach by studying residual ideals of the graded algebra as an abstract counterpart of certain residual polynomials which play a key role in t...

متن کامل

extensions of some polynomial inequalities to the polar derivative

توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی

15 صفحه اول

Inductive Databases of Polynomial Equations

Inductive databases (IDBs) contain both data and patterns. Here we consider IDBs where patterns are polynomial equations. We present a constraint-based approach to answering inductive queries in this domain. The approach is based on heuristic search through the space of polynomial equations and can use subsumption and evaluation constraints on polynomial equations. We evaluate this approach on ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 2021

ISSN: ['1873-1376', '0022-4049']

DOI: https://doi.org/10.1016/j.jpaa.2021.106668